The second Zagreb indices of graphs with given degree sequences
نویسندگان
چکیده
منابع مشابه
The Second Zagreb Indices and Wiener Polarity Indices of Trees with Given Degree Sequences
Given a tree T = (V,E), the second Zagreb index of T is denoted by M2(T ) = ∑ uv∈E d(u)d(v) and the Wiener polarity index of T is equal to WP (T ) = ∑ uv∈E(d(u)−1)(d(v)−1). Let π = (d1, d2, ..., dn) and π′ = (d1, d2, ..., dn) be two different non-increasing tree degree sequences. We write π π′, if and only if ∑n i=1 di = ∑n i=1 d ′ i, and ∑j i=1 di ≤ ∑j i=1 d ′ i for all j = 1, 2, ..., n. Let Γ...
متن کاملQuasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse gra...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملFirst and Second Zagreb Eccentricity Indices of Thorny Graphs
The Zagreb eccentricity indices are the eccentricity reformulation of the Zagreb indices. Let H be a simple graph. The first Zagreb eccentricity index (E1(H)) is defined to be the summation of squares of the eccentricity of vertices, i.e., E1(H) = ∑u∈V(H) Symmetry 2016, 9, 7; doi: 10.3390/sym9010007 www.mdpi.com/journal/symmetry Article First and Second Zagreb Eccentricity Indices of Thorny Gra...
متن کاملOn leap Zagreb indices of graphs
The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.12.015